976A - Minimum Binary Number - CodeForces Solution


implementation *800

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
#define 	ll				long long
#define 	vi				vector<int>
#define 	vll				vector<long long>
#define 	all(x)			(x).begin(),(x).end()
#define		allr(x)			(x).rbegin(),(x).rend()
#define		nl				"\n"
#define 	nayon			ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;

int main(){
    //int t;cin>>t; while(t--){
        int n;cin>>n;
        string s;cin>>s;
        int z=0;
        if(n==1) cout<<s<<nl;
        else{
            for(int i=0;i<s.size();++i){
                if(s[i]=='0') z++;
            }
            cout<<'1'<<string(z,'0')<<nl;
        }
    //}
}


Comments

Submit
0 Comments
More Questions

80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera
776A - A Serial Killer
25B - Phone numbers
1633C - Kill the Monster
1611A - Make Even
1030B - Vasya and Cornfield
1631A - Min Max Swap
1296B - Food Buying
133A - HQ9+
1650D - Twist the Permutation
1209A - Paint the Numbers
1234A - Equalize Prices Again
1613A - Long Comparison
1624B - Make AP
660B - Seating On Bus
405A - Gravity Flip
499B - Lecture